Workflow Analysis using Attributed Metagraphs

Graph-theoretic methods for analyzing workflows and processes can provide insight into important problems in process design, and can help in the design of effective workflows. In particular, representation of workflows as metagraphs has been shown to provide a useful basis for formal analysis of processes and workflows. In this paper, we show how attributed metagraphs can be used to analyze workflows that have tasks with specified temporal constraints. In particular, we show how we can identify time-critical tasks and critical paths through workflows, which generalize traditional network scheduling (PERT/CPM) methods used in